Unconditional stability of difference formulas
نویسندگان
چکیده
منابع مشابه
Unconditional stability of parallel difference schemes with second order accuracy for parabolic equation
In this paper we investigate the parallel difference schemes of parabolic equation, in particular, two kinds of difference schemes with intrinsic parallelism are constructed. Firstly we combine the values of previous two time levels at the interface points to get the (Dirichlet) boundary condition for the sub-domain problems. Then the values in the sub-domains are calculated by fully implicit s...
متن کاملUpgrading color-difference formulas.
We propose a method to improve the prediction performance of existing color-difference formulas with additional visual data. The formula is treated as the mean function of a Gaussian process, which is trained with experimentally determined color-discrimination data. Color-difference predictions are calculated using Gaussian process regression (GPR) considering the uncertainty of the visual data...
متن کاملUnconditional stability of the Foschini-Miljanic algorithm
In this note we prove the unconditional stability of the Foschini-Miljanic algorithm. Our results show that the Foschini-Miljanic algorithm is unconditionally stable (convergent) even in the presence of bounded time-varying communication delays, and in the presence of topology changes. The implication of our results may be important for the design of Code Division Multiple Access (CDMA) based w...
متن کاملUnconditional Stability for Multistep ImEx Schemes: Theory
This paper presents a new class of high order linear ImEx multistep schemes with large regions of unconditional stability. Unconditional stability is a desirable property of a time stepping scheme, as it allows the choice of time step solely based on accuracy considerations. Of particular interest are problems for which both the implicit and explicit parts of the ImEx splitting are stiff. Such ...
متن کاملStability of Barycentric Interpolation Formulas
The barycentric interpolation formula defines a stable algorithm for evaluation at points in [−1, 1] of polynomial interpolants through data on Chebyshev grids. Here it is shown that for evaluation at points in the complex plane outside [−1, 1], the algorithm becomes unstable and should be replaced by the alternative modified Lagrange or “first barycentric” formula dating to Jacobi in 1825. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1983
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1983.104008